On Equations for Union-Free Regular Languages
نویسندگان
چکیده
منابع مشابه
Complexity in Union-Free Regular Languages
We continue the investigation of union-free regular languages that are described by regular expressions without the union operation. We also define deterministic union-free languages as languages accepted by one-cycle-free-path deterministic finite automata, and show that they are properly included in the class of union-free languages. We prove that (deterministic) union-freeness of languages d...
متن کاملMinimal Union-Free Decompositions of Regular Languages
A regular language is called union-free if it can be represented by a regular expression that does not contain the union operation. Every regular language can be decomposed into a union of a finite number of union-free languages (the so-called union-free decomposition). We call the number of components in the minimal union-free decomposition of a regular language the union width of the regular ...
متن کاملMost Complex Deterministic Union-Free Regular Languages
A regular language L is union-free if it can be represented by a regular expression without the union operation. A union-free language is deterministic if it can be accepted by a deterministic one-cycle-freepath finite automaton; this is an automaton which has one final state and exactly one cycle-free path from any state to the final state. Jirásková and Masopust proved that the state complexi...
متن کاملOn Union-Free and Deterministic Union-Free Languages
The paper continues the study of union-free and deterministic union-free languages. In contrast with the fact that every regular language can be described as a finite union of union-free languages, we show that the finite unions of deterministic union-free languages define a proper subfamily of regular languages. Then we examine the properties of this subfamily.
متن کاملOverlap-Free Regular Languages
We define a language to be overlap-free if any two distinct strings in the language do not overlap with each other. We observe that overlap-free languages are a proper subfamily of infix-free languages and also a proper subfamily of comma-free languages. Based on these observations, we design a polynomial-time algorithm that determines overlapfreeness of a regular language. We consider two case...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Information and Computation
سال: 2001
ISSN: 0890-5401
DOI: 10.1006/inco.2000.2889